Cyclic Petri net reachability sets are semi-linear effectively constructible
نویسندگان
چکیده
We prove that cyclic Petri net reachability sets are nite unions of linear combinations of integer vectors whose sizes are exponential in the size of the cyclic Petri net.
منابع مشابه
Cyclic Petri Net Reachability Sets are Semi - linear E ectively
We prove that cyclic Petri net reachability sets are nite unions of linear combinations of integer vectors whose sizes are exponential in the size of the cyclic Petri net.
متن کاملOn Computing Reachability Sets of Process Rewrite Systems
We consider the problem of symbolic reachability analysis of a class of term rewrite systems called Process Rewrite Systems (PRS). A PRS can be seen as the union of two mutually interdependent sets of term rewrite rules: a prefix rewrite system (or, equivalently, a pushdown system), and a multiset rewrite system (or, equivalently, a Petri net). These systems are natural models for multithreaded...
متن کاملPetri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequentl...
متن کاملReversal-Bounded Counter Machines Revisited
We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this p...
متن کاملFinkel , Alain and Sangnier , Arnaud Reversal - bounded counter machines revisited Research Report LSV - 08 - 33 December 2008
We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 9 شماره
صفحات -
تاریخ انتشار 1997